#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+7;
int mu[MAXN];
int prime[MAXN], p_cnt;
bool not_p[MAXN];
void Init() {
    p_cnt = 0;
    mu[1] = 1;
    for (int i=2; i<MAXN; ++i) {
        if (!not_p[i]) {
            prime[p_cnt++] = i;
            mu[i] = -1;
        }
        for (int j=0; j<p_cnt&&prime[j]*i<MAXN; ++j) {
            not_p[i*prime[j]] = true;
            if (i%prime[j]==0) {
                mu[i*prime[j]] = 0;
                break;
            }
            else {
                mu[i*prime[j]] = -mu[i];
            }
        }
    }
}

int main() {
    Init();
    for (int i=1; i<=20; ++i) {
        printf("%d: %d\n", i, mu[i]);
    }

    return 0;
}
